//<p>给定一个只包括 <code>'('</code>，<code>')'</code>，<code>'{'</code>，<code>'}'</code>，<code>'['</code>，<code>']'</code> 的字符串 <code>s</code> ，判断字符串是否有效。</p>
//
//<p>有效字符串需满足：</p>
//
//<ol>
//	<li>左括号必须用相同类型的右括号闭合。</li>
//	<li>左括号必须以正确的顺序闭合。</li>
//</ol>
//
//<p> </p>
//
//<p><strong>示例 1：</strong></p>
//
//<pre>
//<strong>输入：</strong>s = "()"
//<strong>输出：</strong>true
//</pre>
//
//<p><strong>示例 2：</strong></p>
//
//<pre>
//<strong>输入：</strong>s = "()[]{}"
//<strong>输出：</strong>true
//</pre>
//
//<p><strong>示例 3：</strong></p>
//
//<pre>
//<strong>输入：</strong>s = "(]"
//<strong>输出：</strong>false
//</pre>
//
//<p><strong>示例 4：</strong></p>
//
//<pre>
//<strong>输入：</strong>s = "([)]"
//<strong>输出：</strong>false
//</pre>
//
//<p><strong>示例 5：</strong></p>
//
//<pre>
//<strong>输入：</strong>s = "{[]}"
//<strong>输出：</strong>true</pre>
//
//<p> </p>
//
//<p><strong>提示：</strong></p>
//
//<ul>
//	<li><code>1 <= s.length <= 10<sup>4</sup></code></li>
//	<li><code>s</code> 仅由括号 <code>'()[]{}'</code> 组成</li>
//</ul>
//<div><div>Related Topics</div><div><li>栈</li><li>字符串</li></div></div><br><div><li>👍 3238</li><li>👎 0</li></div>

package com.rising.leetcode.editor.cn;

import java.util.HashMap;
import java.util.Map;
import java.util.Stack;

/**
 * 有效的括号
 * @author DY Rising
 * @date 2022-05-10 11:20:14
 */
public class P20_ValidParentheses{
    public static void main(String[] args) {
        //测试代码
        Solution solution = new P20_ValidParentheses().new Solution();
        System.out.println(solution.isValid("({{{{}}}))"));
    }
	 
//力扣代码
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public boolean isValid(String s) {
        if (s.length() <= 1 || s.length() % 2 != 0) return false;
        char[] chars = s.toCharArray();
        Stack<Character> stack = new Stack<>();
        Map<Character, Character> map = new HashMap<>();
        map.put(')', '(');
        map.put(']', '[');
        map.put('}', '{');
        for (int i = 0; i < chars.length; i++) {
            if (chars[i] == '(' || chars[i] == '[' || chars[i] == '{') {
                stack.push(chars[i]);
            }
            if (chars[i] == ')' || chars[i] == ']' || chars[i] == '}') {
                if (stack.isEmpty()) return false;
                Character pop = stack.pop();
                if (!map.get(chars[i]).equals(pop)) return false;
            }
        }
        if (stack.isEmpty()) return true;
        return false;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}
